- match algorithm
- алгоритм согласования (напр. двух систем координат), согласующий алгоритм
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
match algorithm
Смотреть что такое "match algorithm" в других словарях:
auction match algorithm — Auction Matching/ Auction Match Algorithm The process that matches orders at the end of an auction and determines the auction price. London Stock Exchange Glossary … Financial and business terms
Match moving — In cinematography, match moving is a visual effects, cinematic techniques that allows the insertion of computer graphics into live action footage with correct position, scale, orientation, and motion relative to the photographed objects in the… … Wikipedia
Match rating approach — A phonetic algorithm developed by Western Airlines in 1977 for the indexation and comparison of homophonous names. The algorithm itself has a simple set of encoding rules but a more lengthy set of comparison rules. The main mechanism being the… … Wikipedia
Match Rating Approach — A phonetic algorithm developed by Western Airlines in 1977 for the indexation and comparison of homophonous names. The algorithm itself has a simple set of encoding rules but a more lengthy set of comparison rules.The main mechanism being the… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… … Wikipedia
Rabin-Karp string search algorithm — The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… … Wikipedia
Boyer–Moore string search algorithm — The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… … Wikipedia
Needleman–Wunsch algorithm — The Needleman–Wunsch algorithm performs a global alignment on two sequences (called A and B here). It is commonly used in bioinformatics to align protein or nucleotide sequences. The algorithm was published in 1970 by Saul B. Needleman and… … Wikipedia
Boyer–Moore–Horspool algorithm — In computer science, the Boyer–Moore–Horspool algorithm or Horspool s algorithm is an algorithm for finding substrings in strings. It is a simplification of the Boyer Moore algorithm which is related to the Knuth Morris Pratt algorithm. The… … Wikipedia
String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… … Wikipedia
